Semidefinite complementarity reformulation for robust Nash equilibrium problems with Euclidean uncertainty sets
نویسندگان
چکیده
Consider the N -person non-cooperative game in which each player’s cost function and the opponents’ strategies are uncertain. For such an incomplete information game, the new solution concept called a robust Nash equilibrium has attracted much attention over the past several years. The robust Nash equilibrium results from each player’s decision-making based on the robust optimization policy. In this paper, we focus on the robust Nash equilibrium problem in which each player’s cost function is quadratic, and the uncertainty sets for the opponents’ strategies and the cost matrices are represented by means of Euclidean and Frobenius norms, respectively. Then, we show that the robust Nash equilibrium problem can be reformulated as a semidefinite complementarity problem (SDCP), by utilizing the semidefinite programming (SDP) reformulation technique in robust optimization. We also give some numerical example to illustrate the behavior of robust Nash equilibria. Keyword. non-cooperative games, robust Nash equilibrium, semidefinite programming, semidefinite complementarity problems
منابع مشابه
Smoothing approach to Nash equilibrium formulations for a class of equilibrium problems with shared complementarity constraints
The equilibrium problem with equilibrium constraints (EPEC) can be looked on as a generalization of Nash equilibrium problem (NEP) and the mathematical program with equilibrium constraints (MPEC) whose constraints contain a parametric variational inequality or complementarity system. In this paper, we particularly consider a special class of EPECs where a common parametric P-matrix linear compl...
متن کاملNeural network for solving Nash equilibrium problem in application of multiuser power control
In this paper, based on an equivalent mixed linear complementarity problem, we propose a neural network to solve multiuser power control optimization problems (MPCOP), which is modeled as the noncooperative Nash game in modern digital subscriber line (DSL). If the channel crosstalk coefficients matrix is positive semidefinite, it is shown that the proposed neural network is stable in the sense ...
متن کاملExistence, Uniqueness, and Computation of Robust Nash Equilibria in a Class of Multi-Leader-Follower Games
The multi-leader-follower game can be looked on as a generalization of the Nash equilibrium problem (NEP), which contains several leaders and followers. Recently, the multi-leader-follower game has been drawing more and more attention, for example, in power markets. On the other hand, in such real-world problems, uncertainty normally exists and sometimes cannot simply be ignored. To handle math...
متن کاملA Complementarity Framework for Forward Contracting Under Uncertainty
We consider a particular instance of a stochastic multi-leader multi-follower equilibrium problem in which players compete in the forward and spot markets in successive periods. Proving the existence of such equilibria has proved difficult as has the construction of globally convergent algorithms for obtaining such points. By conjecturing a relationship between forward and spot decisions, we co...
متن کاملSDP reformulation for robust optimization problems based on nonconvex QP duality
In a real situation, optimization problems often involve uncertain parameters. Robust optimization is one of distribution-free methodologies based on worst-case analyses for handling such problems. In this paper, we first focus on a special class of uncertain linear programs (LPs). Applying the duality theory for nonconvex quadratic programs (QPs), we reformulate the robust counterpart as a sem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Global Optimization
دوره 53 شماره
صفحات -
تاریخ انتشار 2012